Double dimer covers on snake graphs from super cluster expansions
نویسندگان
چکیده
In a recent paper, the authors gave combinatorial formulas for Laurent expansions of super λ -lengths in marked disk, generalizing Schiffler's T -path formula. present we give an alternate expression these terms double dimer covers on snake graphs. This generalizes Musiker, Schiffler, and Williams.
منابع مشابه
Orthogonal Double Covers by Super-Extendable Cycles
An Orthogonal Double Cover (ODC) of the complete graph Kn by an almosthamiltonian cycle is a decomposition of 2Kn into cycles of length n 1 such that the intersection of any two of them is exactly one edge.We introduce a new class of such decompositions. If n is a prime, the special structure of such a decomposition allows to expand it to an ODC of Knþ1 by an almost-hamiltonian cycle. This yiel...
متن کاملVertex Equitable Labeling of Double Alternate Snake Graphs
Let G be a graph with p vertices and q edges and A = {0, 1, 2, . . . , [q/2]}. A vertex labeling f : V (G) → A induces an edge labeling f∗ defined by f∗(uv) = f(u) + f(v) for all edges uv. For a ∈ A, let vf (a) be the number of vertices v with f(v) = a. A graph G is said to be vertex equitable if there exists a vertex labeling f such that for all a and b in A, |vf (a) − vf (b)| ≤ 1 and the indu...
متن کاملSuborthogonal double covers of complete graphs
A family G of isomorphic copies of a given graph G is said to be a suborthogonal double cover (SODC) of the complete graph K n by G, if every edge of K n belongs to exactly two members of G and any two diierent elements from G share at most one edge. We introduce the notion of an SODC as a generalization of the well-known concept of orthogonal double covers. Our objective is to investigate the ...
متن کاملOrthogonal double covers of complete bipartite graphs
Let H = {A1, . . . , An, B1, . . . , Bn} be a collection of 2n subgraphs of the complete bipartite graph Kn,n. The collection H is called an orthogonal double cover (ODC) of Kn,n if each edge of Kn,n occurs in exactly two of the graphs in H; E(Ai) ∩ E(Aj) = φ = E(Bi) ∩ E(Bj) for every i, j ∈ {1, . . . , n} with i = j, and for any i, j ∈ {1, . . . , n}, |E(Ai)∩E(Bj)| = 1. If Ai ∼= G ∼= Bi for al...
متن کامل6-cycle Double Covers of Cubic Graphs
A cycle double cover (CDC) of an undirected graph is a collection of the graph’s cycles such that every edge of the graph belongs to exactly two cycles. We describe a constructive method for generating all the cubic graphs that have a 6-CDC (a CDC in which every cycle has length 6). As an application of the method, we prove that all such graphs have a Hamiltonian cycle. A sense of direction is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 2022
ISSN: ['1090-266X', '0021-8693']
DOI: https://doi.org/10.1016/j.jalgebra.2022.05.033